A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance
نویسندگان
چکیده
منابع مشابه
A Fast Algorithm for Simulated Annealing
We present a new deterministic algorithm for simulated annealing and demonstrate its applicability with several classical examples: the ground state energies of the 2d and 3d short range king spin glasses, the traveling salesman problem, and pattern recognition in computer vision. Our algorithm is based on a microcanonical Monte Carlo method and is shown to be a powerful tool for the analysis o...
متن کاملA Fast KNN Algorithm Based on Simulated Annealing
-K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k nearest neighbors quickly. Simulated annealing algorithm and inverted array are used to help find out the expected neighbors. Our experimental results demonstrate a significant improvement in classification computation...
متن کاملA Fast Kinoform Optimization Algorithm Based on Simulated Annealing
Computer Generated Holography (CGH) [7] is a technique which generate a hologram by using computers. The CGH can be used in many applications, such as optical interconnection, optical information, optical elements and so on. The great advantage of the CGH is that it can be generate a hologram of virtual objects. The kinoform [6], one of the CGHs, is an attractive device that can manage wave fro...
متن کاملHardware-Assisted Simulated Annealing with Application to Fast FPGA Placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand placement times as short as microseconds. In this paper, we show how a systolic structure can accelerate placement by assigning one processing element to each possible location for an FPGA LUT from a design netlist. We ...
متن کاملAnalog Macro-Cell Placement with Very Fast Simulated Re-Annealing Algorithm
This paper presents the analog macro-cell placement using the novel very fast simulated re-annealing algorithm, which is exponentially faster than the classical Cauchy or Bolzmann annealing. A slide function is applied to convert the absolute placement to relative placement, which greatly decreases the configuration space without degrading the searching opportunity. The cost function is set up ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1996
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1996/58084